Many-valued Logic Programming and Fixpoint Semantics for Higher-order Herbrand Models
نویسنده
چکیده
In this paper we compare the two versions of knowledge invariant transformations of the original Many-valued logic programs: the strict Annotated logic programs and the ’meta’ logic programs obtained by the ontological encapsulation [1]. We show that the first one has the higher-order Herbrand interpretations, while the last can be seen as the flattening of the first one. These two knowledge invariant 2-valued logic transformations of the 4-valued Belnap’s bilattice-based logic, able to handle incompleteness and inconsistency of knowledge-base systems, are mutually inverse in Galois connection based on predicate compression and decompression (flattening). Consequently, we can use this Galois connection between them to establish their fixpoint semantics relationship. This results generalize the truth-knowledge fixpoint semantics for many-valued logic programming [2].
منابع مشابه
Truth and knowledge fixpoint semantics for many-valued logic programming
The variety of semantical approaches that have been invented for logic programs for reasoning about inconsistent databases is quite broad. Especially, we are interested in an ontological encapsulation of a many-valued logics with negation, based on bilattices, into a 2-valued logic: this new approach is a minimilistic one based on the concept of the semantic reflection. We define a Model theore...
متن کاملCoalgebraic semantics for logic programs
General logic programs with negation have the 3-valued minimal Herbrand models based on the Kripke’s fixpoint knowledge revision operator and on Clark’s completion. Based on these results we deifine a new algebra , (with the relational algebra embedded in it), and present an algorithmic transformation of logic programs into the system of tuple-variable equations which is a -coalgebra. The solut...
متن کاملReduction of Many-valued into Two-valued Modal Logics
In this paper we develop a 2-valued reduction of many-valued logics, into 2-valued multi-modal logics. Such an approach is based on the contextualization of many-valued logics with the introduction of higher-order Herbrand interpretation types, where we explicitly introduce the coexistence of a set of algebraic truth values of original many-valued logic, transformed as parameters (or possible w...
متن کاملFixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for such programs. We show that many-valued disjunctive logic programs under the semantics of minimal models, perfect models, stable models, and least model states can be unfolded to equivalent classical disjunctive logic pr...
متن کاملLogic Methods for Many-valued Logics: Higher-order Autoepistemic Language Concepts
The higher-order types of Herbrand interpretations for databases arise often in practice when we have to deal with uncertain or imprecise information, or in constrained databases. They are a consequence of the introduction of a kind of the observational equivalence for the hidden information in the ordinary Herbrand interpretations. It means that the logics for such databases are particular fun...
متن کامل